Sparse Maximum Margin Learning from Multimodal Human Behavioral Patterns

نویسندگان

چکیده

We propose a multimodal data fusion framework to systematically analyze human behavioral from specialized domains that are inherently dynamic, sparse, and heterogeneous. develop two-tier architecture of probabilistic mixtures, where the lower tier leverages parametric distributions exponential family extract significant patterns each modality. These then organized into dynamic latent state space at higher fuse different modalities. In addition, our jointly performs pattern discovery maximum-margin learning for downstream classification tasks by using group-wise sparse prior regularizes coefficients classifier. Therefore, discovered highly interpretable discriminative support tasks. Experiments on real-world medical psychological demonstrate discovers meaningful with improved interpretability prediction performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Learning via Maximum Margin Matrix Factorization

In this paper, an algorithm for sparse learning via Maximum Margin Matrix Factorization(MMMF) is proposed. The algorithm is based on L1 penality and Alternating Direction Method of Multipliers. It shows that with sparse factors, sparse factors method can obtain result as good as dense factors.

متن کامل

Maximum Margin Multi-Instance Learning

Multi-instance learning (MIL) considers input as bags of instances, in which labels are assigned to the bags. MIL is useful in many real-world applications. For example, in image categorization semantic meanings (labels) of an image mostly arise from its regions (instances) instead of the entire image (bag). Existing MIL methods typically build their models using the Bag-to-Bag (B2B) distance, ...

متن کامل

Linear Maximum Margin Classifier for Learning from Uncertain Data

In this paper, we propose a maximum margin classifier that deals with uncertainty in data input. More specifically, we reformulate the SVM framework such that each training example can be modeled by a multi-dimensional Gaussian distribution described by its mean vector and its covariance matrix – the latter modeling the uncertainty. We address the classification problem and define a cost functi...

متن کامل

28 : Maximum - Margin Learning of Graphical Models

The goal of classical predictive models like logistic regression or kernel-based approaches such as support vector machines (SVM) is to find a function which assigns a label to objects given a set of features. Even though these techniques have strong theoretical guarantees and work well on high-dimensional spaces, they ignore the underlying structure that the features may possess as in the case...

متن کامل

Maximum Margin Planning Maximum Margin Planning

Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to execute is often clear, while specifying costs that engender this behavior is a much more difficult task. This is particularly apparent when attempting to simultaneously tune many parameters that define the mapping fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i4.25676